Reduced Cost-Based Ranking for Generating Promising Subproblems
نویسندگان
چکیده
In this paper, we propose an effective search procedure that interleaves two steps: subproblem generation and subproblem solution. We mainly focus on the first part. It consists of a variable domain value ranking based on reduced costs. Exploiting the ranking, we generate, in a Limited Discrepancy Search tree, the most promising subproblems first. An interesting result is that reduced costs provide a very precise ranking that allows to almost always find the optimal solution in the first generated subproblem, even if its dimension is significantly smaller than that of the original problem. Concerning the proof of optimality, we exploit a way to increase the lower bound for subproblems at higher discrepancies. We show experimental results on the TSP and its time constrained variant to show the effectiveness of the proposed approach, but the technique could be generalized for other problems.
منابع مشابه
A hybrid constraint programming and semidefinite programming approach for the stable set problem
This work presents a hybrid approach to solve the maximum stable set problem, using constraint and semidefinite programming. The approach consists of two steps: subproblem generation and subproblem solution. First we rank the variable domain values, based on the solution of a semidefinite relaxation. Using this ranking, we generate the most promising subproblems first, by exploring a search tre...
متن کاملProblem Splitting Using Heuristic Search in Landmark Orderings
In this paper, we revisit the idea of splitting a planning problem into subproblems hopefully easier to solve with the help of landmark analysis. While this technique initially proposed in the first approaches related to landmarks has been outperformed by landmark-based heuristics, we believe that it is still a promising research direction. To this end, we propose a new method for problem split...
متن کاملLong Term Cost Effective Preventive Maintenance Scheduling
Preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. It consists of knowing which generating units should be shut down for regular safety inspection. In this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (CRI) is pr...
متن کاملGraph Coloring via Constraint Programming-based Column Generation
This paper presents a Constraint Programming-based Column Generation approach to the Minimum Graph Coloring problem. The proposed approach has two versions of the pricing subproblems: the first version formulates the pricing subproblem as the optimization problem of finding the most negative reduced cost column, the second version as the decision problem of finding a maximal stable set with neg...
متن کاملNew Lagrangian Relaxation Based Algorithm for Resource Scheduling with Homogeneous Subproblems
Solution oscillations, often caused by identical solutions to the homogeneous subproblems, constitute a severe and inherent disadvantage in applying Lagrangian relaxation based methods to resource scheduling problems with discrete decision variables. In this paper, the solution oscillations caused by homogeneous subproblems in the Lagrangian relaxation framework are identified and analyzed. Bas...
متن کامل